UHFFT: A High Performance DFT Framework
نویسندگان
چکیده
We present a framework for algorithm selection, code generation and optimization for the Fast Fourier Transform. The framework consists of two main parts – the DFT Code Generator (FftGen) and the Execution Scheduler (FftPlanner). The library generator outputs a highly optimized set of small to modest size DFT codelets written in ‘C’. The FftPlanner searches an exponential space of possible algorithms, factors and schedules to select the best computation plan at run time. UHFFT is a high performance and portable framework that adapts to underlying architecture. We present two sets of results on two different architectures; Itanium2 and Opteron. We also compare our performance against other vendor and non-vendor FFT computation libraries.
منابع مشابه
Automatic Performance Tuning in the UHFFT Library
In this paper we describe the architecture{speci c automatic performance tuning implemented in the UHFFT library. The UHFFT library is an adaptive and portable software library for fast Fourier transforms (FFT).
متن کاملAdaptive Dynamic Scheduling of Fft on Hierarchical Memory and Multi - Core Architectures
In this dissertation, we present a framework for expressing, evaluating and executing dynamic schedules for FFT computation on hierarchical and shared memory multiprocessor / multi-core architectures. The framework employs a two layered optimization methodology to adapt the FFT computation to a given architecture and dataset. At installation time, the code generator adapts to the microprocessor...
متن کاملAutomatic Performance Tuning for Fast Fourier Transforms
In this paper we discuss architecture-specific performance tuning for fast Fourier transforms (FFTs) implemented in the UHFFT library. The UHFFT library is an adaptive and portable software library for FFTs developed by the authors. We present the optimization methods used at different levels, starting with the algorithm selection used for the library code generation and ending with the actual ...
متن کاملDiscrete Fourier Transform Compiler: From Mathematical Representation to Efficient Hardware
A wide range of hardware implementations are possible for the discrete Fourier transform (DFT), offering different tradeoffs in throughput, latency and cost. The well-understood structure of DFT algorithms makes possible a fully automatic synthesis framework that can span the viable interesting design choices. In this paper, we present such a synthesis framework that starts from formal mathemat...
متن کاملComputer Generation of Fourier Transform Libraries for Distributed Memory Architectures
High-performance discrete Fourier transform (DFT) libraries are an important requirement for many computing platforms. Unfortunately, developing and optimizing these libraries for modern, complex platforms has become extraordinarily difficult. Tomake thingsworse, performance often does not port, thus requiring permanent re-optimizations. Overcoming this problem has been the goal of SPIRAL, a li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007